Intuitionistic Heuristic Prototype-based Algorithm of Possibilistic Clustering
نویسندگان
چکیده
This paper introduces a novel intuitionistic fuzzy set-based heuristic algorithm of possibilistic clustering. For the purpose, some remarks on the fuzzy approach to clustering are discussed and a brief review of intuitionistic fuzzy set-based clustering procedures is given, basic concepts of the intuitionistic fuzzy set theory and the intuitionistic fuzzy generalization of the heuristic approach to possibilistic clustering are considered, a general plan of the proposed clustering procedure is described in detail, two illustrative examples confirm good performance of the proposed algorithm, and some preliminary conclusions are formulated. General Terms Pattern Recognition, Clustering, Algorithm.
منابع مشابه
Hierarchical Intuitionistic Fuzzy Possibilistic C Means Kernel Clustering Algorithm for Distributed Networks
Advances in distributed networking have resulted in an explosion in size of modern datasets while storage and processing power continue to lag behind. This requires the need for algorithms that are efficient in terms of number of measurements and running time. To combat challenges associated with large datasets in distributed networks we propose hierarchical intuitionistic fuzzy possibilistic c...
متن کاملA New Validity Measure for Heuristic Possibilistic Clustering
A heuristic approach to possibilistic clustering is the effective tool for the data analysis. The approach is based on the concept of allotment among fuzzy clusters. To establish the number of clusters in a data set, a validity measure is proposed in this paper. An illustrative example of application of the proposed validity measure to the Anderson’s Iris data is given. A comparison of the vali...
متن کاملMulticriteria Ordering and Ranking: Partial Orders, Ambiguities and Applied Issues
The paper deals in a preliminary way with the problem of the selection of a unique fuzzy preference relation from the set of fuzzy preference relations. A direct algorithm of possibilistic clustering is the basis of the method of fuzzy preference relation discriminating. A method of decision-making based on a fuzzy preference relation is described and basic concepts of the heuristic method of p...
متن کاملA Heuristic Possibilistic Approach to Clustering for Asymmetric Data
This paper deals with the problem of clustering of asymmetric data. A method of the problem solving is based on the application of a direct possibilistic clustering algorithm based on the concept of allotment among fuzzy cluster to a matrix of fuzzy tolerance, which correspond to the set of objects, for which asymmetric distances or proximities hold. The paper provides the description of the me...
متن کاملOn relational possibilistic clustering
This paper initially describes the relational counterpart of possibilistic c-means (PCM) algorithm, called relational PCM (or RPCM). RPCM is then improved to better handle arbitrary dissimilarity data. First, a re-scaling of the PCM membership function is proposed in order to obtain zero membership values when the distance to prototype equals the maximum value allowed in bounded dissimilarity m...
متن کامل